Estimating processes in adapted Wasserstein distance
نویسندگان
چکیده
A number of researchers have independently introduced topologies on the set laws stochastic processes that extend usual weak topology. Depending respective scientific background this was motivated by applications and connections to various areas (e.g., Plug–Pichler—stochastic programming, Hellwig—game theory, Aldous—stability optimal stopping, Hoover–Keisler—model theory). Remarkably, all these seemingly independent approaches define same adapted topology in finite discrete time. Our first main result is construct an variant empirical measure consistently estimates full generality. natural compatible metric for given refinement Wasserstein distance, as established seminal works Pflug–Pichler. Specifically, distance allows control error optimization problems, pricing hedging stopping etcetera a Lipschitz fashion. The second article yields quantitative bounds convergence with respect distance. Surprisingly, we obtain virtually rates concentration results are known classical wrt.
منابع مشابه
Wasserstein Distance Measure Machines
This paper presents a distance-based discriminative framework for learning with probability distributions. Instead of using kernel mean embeddings or generalized radial basis kernels, we introduce embeddings based on dissimilarity of distributions to some reference distributions denoted as templates. Our framework extends the theory of similarity of Balcan et al. (2008) to the population distri...
متن کاملMinimax Distribution Estimation in Wasserstein Distance
The Wasserstein metric is an important measure of distance between probability distributions, with several applications in machine learning, statistics, probability theory, and data analysis. In this paper, we upper and lower bound minimax rates for the problem of estimating a probability distribution underWasserstein loss, in terms of metric properties, such as covering and packing numbers, of...
متن کاملThe Gromov-Wasserstein Distance: A Brief Overview
We recall the construction of the Gromov–Wasserstein distance and concentrate on quantitative aspects of the definition.
متن کاملDistributionally Robust Stochastic Optimization with Wasserstein Distance
Distributionally robust stochastic optimization (DRSO) is a robust approach to stochastic optimization problems in which the underlying distribution is not known exactly. It seeks a decision which hedges against the worst-case distribution in an ambiguity set, containing a family of distributions relevant to the considered problem. Unfortunately, the worst-case distributions resulting from many...
متن کاملGenerative Modeling using the Sliced Wasserstein Distance
Generative Adversarial Nets (GANs) are very successful at modeling distributions from given samples, even in the high-dimensional case. However, their formulation is also known to be hard to optimize and often not stable. While this is particularly true for early GAN formulations, there has been significant empirically motivated and theoretically founded progress to improve stability, for insta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Applied Probability
سال: 2022
ISSN: ['1050-5164', '2168-8737']
DOI: https://doi.org/10.1214/21-aap1687